Magic Numbers in Polygonal and Polyhedral Clusters
نویسنده
چکیده
Certain values for the nuclearity of clusters tend to occur more frequently than others. This paper gives a mathematical derivation of the preferred values of nuclearity (the “magic numbers”) corresponding to various symmetrical, close-packed polygons (in two dimensions) and polyhedra (in three dimensions). Simple general formulas are obtained for the numbers of atoms in these clusters. Explicit coordinates are given for the atoms. Application of these atom-counting results to electron counting of close-packed high-nuclearity metal clusters is illustrated.
منابع مشابه
NUMERICAL SIMULATIONS OF THE PHASE TRANSITIONS IN CLUSTERS
We have studied the phase transitions in atomic clusters by molecular dynamics simulation, assuming Lennard-Jones interatomic pair potential. Calculations are performed by DAP parallel computer. The results are analyzed by simulating their orientational distribution plots (dot-plot), and neutron diffraction patterns. It is shown that all the main features of the bulk phase transitions are e...
متن کاملMagic numbers for metallic clusters and the principle of maximum hardness.
It is shown that for relatively more stable metallic clusters (those with magic number of atoms) the chemical hardness (I-A) too is relatively larger. Thus the occurrence of magic numbers for metal clusters whose stability is determined by their electronic shell structure can be understood as a manifestation of the principle of maximum hardness. This may also represent a possible way of delinea...
متن کاملInterplay between magic number stabilities and superfluidity of small parahydrogen clusters.
The interplay between magic number stabilities and superfluidity of small parahydrogen clusters with sizes N=5 to 40 and temperatures 0.5 K</=T</=4.5 K is explored with classical and quantum path integral Monte Carlo calculations. Clusters with N<26 and T</=1.5 K have large superfluid fractions even at the stable magic numbers 13, 19, and 23. In larger clusters, superfluidity is quenched especi...
متن کاملGeneralized Voronoi Diagrams on Polyhedral Terrains
We present an algorithm for computing exact shortest paths, and consequently distances, from a generalized source (point, segment, polygonal chain or polygonal region) on a polyhedral terrain in which polygonal chain or polygon obstacles are allowed. We also present algorithms for computing discrete Voronoi diagrams of a set of generalized sites (points, segments, polygonal chains or polygons) ...
متن کاملClusters of polyhedra in spherical confinement.
Dense particle packing in a confining volume remains a rich, largely unexplored problem, despite applications in blood clotting, plasmonics, industrial packaging and transport, colloidal molecule design, and information storage. Here, we report densest found clusters of the Platonic solids in spherical confinement, for up to [Formula: see text] constituent polyhedral particles. We examine the i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001